• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Çмú´ëȸ ÇÁ·Î½Ãµù

Ȩ Ȩ > ¿¬±¸¹®Çå > Çмú´ëȸ ÇÁ·Î½Ãµù > Çѱ¹Á¤º¸Åë½ÅÇÐȸ Çмú´ëȸ > 2016³â Ãß°èÇмú´ëȸ

2016³â Ãß°èÇмú´ëȸ

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) À¯Àü¾Ë°í¸®ÁòÀÇ ¿¬»ê󸮸¦ ÅëÇÑ ¼Õ»óµÈ °æ·ÎÀÇ È¿À²ÀûÀÎ ´ëü°æ·Î Ž»ö±â¹ý
¿µ¹®Á¦¸ñ(English Title) Efficient alternative route path-search techniques to the damaged path using genetic algorithm processing
ÀúÀÚ(Author) ÁöÈ«ÀÏ   ¹®¼®È¯   Hong-il Ji   Seok-hwan Moon  
¿ø¹®¼ö·Ïó(Citation) VOL 20 NO. 02 PP. 0729 ~ 0731 (2016. 10)
Çѱ۳»¿ë
(Korean Abstract)
º» ³í¹®¿¡¼­´Â Á¦¾ÈÇÑ ¾Ë°í¸®ÁòÀº ÀÌÀü À¯Àü ¾Ë°í¸®ÁòÀÇ ºÐ»ê󸮸¦ À§ÇØ ¶ó¿ìÅÍ ±×·ì ´ÜÀ§ÀÎ ¼¿À» µµÀÔÇÏ¿´´Ù. ±âÁ¸ ÃÖÀû°æ·Î ¾Ë°í¸®ÁòÀÎ Dijkstra ¾Ë°í¸®Áò¿¡¼­ ³×Æ®¿öÅ©°¡ ¼Õ»óµÇ¾úÀ» °æ¿ì Á¦¾ÈÇÑ ¾Ë°í¸®Áò¿¡´Â ´ëü °æ·Î ¼³Á¤ÀÇ ¿¬»ê½Ã°£ÀÌ ´ÜÃàµÇ¾úÀ¸¸ç ¼Õ»óµÈ ³×Æ®¿öÅ©ÀÇ ¼¿ ¾È¿¡¼­ 2¼øÀ§ÀÇ °æ·Î¸¦ °¡Áö°í ÀÖÀ¸¹Ç·Î Dijkstra ¾Ë°í¸®Áòº¸´Ù ½Å¼ÓÇÏ°Ô ´ëü°æ·Î¸¦ ¼³Á¤Çϵµ·Ï ¼³°èµÇ¾ú´Ù. ÀÌ´Â Á¦¾ÈÇÑ ¾Ë°í¸®ÁòÀÌ ³×Æ®¿öÅ©»ó¿¡¼­ Dijkstra ¾Ë°í¸®ÁòÀÌ ¼Õ»óµÇ¾úÀ» °æ¿ì ´ëü °æ·Î¼³Á¤À» º¸¿ÏÇÒ ¼ö ÀÖÀ½À» È®ÀÎÇÏ¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
The efficiency of genetic algorithm may be improved, as genetic generation increases. However, a number of algorithms are needed until desired results are obtained. In addition, if Hoc unit increases when linked to a network, there may be a need to compare with all the cases, which would result in many algorithms at a time, and if a single process deals with such algorithms, the efficiency will decrease. Therefore, efficiency of overall network will be decreased in the end. Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm.
Å°¿öµå(Keyword) À¯Àü¾Ë°í¸®Áò   ´ëü°æ·ÎŽ»ö   ¹«¼±³×Æ®¿öÅ©  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå